Maintaining dynamic minimum spanning trees: An experimental studyCATTANEO, Giuseppe; FARUOLO, Pompeo; FERRARO PETRILLO, Umberto et al.Lecture notes in computer science. 2002, pp 111-125, issn 0302-9743, isbn 3-540-43977-3, 15 p.Conference Paper

Finding Robust Vertices for 3D Synchronization Based on Euclidean Minimum Spanning TreeTOURNIER, N; PUECH, W; SUBSOL, G et al.Proceedings of SPIE, the International Society for Optical Engineering. 2011, Vol 7864, issn 0277-786X, isbn 978-0-8194-8401-7, 78640W.1-78640W.7Conference Paper

Minimum spanning tree-based random-valued impulse noise detection for a switching median filterTANAKA, Go; SUETAKE, Noriaki; UCHINO, Eiji et al.Optics letters. 2008, Vol 33, Num 17, pp 1993-1995, issn 0146-9592, 3 p.Article

On the streaming model augmented with a sorting primitiveAGGARWAL, Gaean; DATAR, Mayur; RAJAGOPALAN, Sridhar et al.Annual Symposium on Foundations of Computer Science. 2004, pp 540-549, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Systemic Risk in Energy Derivative Markets: A Graph-Theory AnalysisLAUTIER, Delphine; RAYNAUD, Franck.The Energy journal (Cambridge, MA). 2012, Vol 33, Num 3, pp 215-239, issn 0195-6574, 25 p.Article

An adaptive spatial clustering algorithm based on the minimum spanning tree-likeMIN DENG; QILIANG LIU; GUANGQIANG LI et al.Proceedings of SPIE, the International Society for Optical Engineering. 2009, Vol 7492, issn 0277-786X, isbn 978-0-8194-7803-0 0-8194-7803-2, 74921Z.1-74921Z.9, 3Conference Paper

Piecewise Linear Curve Approximation Using Graph Theory and Geometrical ConceptsKOUTROUMBAS, Konstantinos D.IEEE transactions on image processing. 2012, Vol 21, Num 9, pp 3877-3887, issn 1057-7149, 11 p.Article

Distributed verification of minimum spanning treesKORMAN, Amos; KUTTEN, Shav.ACM Symposium on Principles of Distributed Computing. 2006, pp 26-34, isbn 1-595-93384-0, 1Vol, 9 p.Conference Paper

Reconstruction of interior layout of building from through-the-wall radar image using MST-based methodBO CHEN; TIAN JIN; BIYING LU et al.Electronics letters. 2014, Vol 50, Num 9, pp 701-703, issn 0013-5194, 3 p.Article

Sensitivity Analysis of Euclidean Minimum Spanning TreeTOURNIER, N; PUECH, W; SUBSOL, G et al.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7526, issn 0277-786X, isbn 0-8194-7919-5 978-0-8194-7919-8, 1Vol, 75260G.1-75260G.10Conference Paper

Distributed Spanner Construction in Doubling Metric SpacesDAMIAN, Mirela; PANDIT, Saurav; PEMMARAJU, Sriram et al.Lecture notes in computer science. 2006, pp 157-171, issn 0302-9743, isbn 3-540-49990-3, 1Vol, 15 p.Conference Paper

A productivity-oriented methodology for local area network design in industrial environmentsESTEPA, Rafael; ESTEPA, Antonio; CUPERTINO, Thiago et al.Computer networks (1999). 2011, Vol 55, Num 9, pp 2303-2314, issn 1389-1286, 12 p.Article

DEVELOPING PROXIMITY GRAPHS BY PHYSARUM POLYCEPHALUM : DOES THE PLASMODIUM FOLLOW THE TOUSSAINT HIERARCHY?ADAMATZKY, Andrew.Parallel processing letters. 2009, Vol 19, Num 1, pp 105-127, issn 0129-6264, 23 p.Article

A benders decomposition approach for the robust spanning tree problem with interval dataMONTEMANNI, Roberto.European journal of operational research. 2006, Vol 174, Num 3, pp 1479-1490, issn 0377-2217, 12 p.Article

Making the edge-set encoding fly by controlling the bias of its crossover operatorROTHLAUF, Franz; TZSCHOPPE, Carsten.Lecture notes in computer science. 2005, pp 202-212, issn 0302-9743, isbn 3-540-25337-8, 11 p.Conference Paper

Chance-constrained programming for fuzzy quadratic minimum spanning tree problemJINWU GAO; MEI LU; LINZHONG LIU et al.IEEE International Conference on Fuzzy Systems. 2004, isbn 0-7803-8353-2, 3Vol, vol 2, 983-987Conference Paper

On the implementation of MST-based heuristics for the Steiner Problem in GraphsPOGGI DE ARAGAO, Marcus; WERNECK, Renato F.Lecture notes in computer science. 2002, pp 1-15, issn 0302-9743, isbn 3-540-43977-3, 15 p.Conference Paper

Weighted inverse minimum spanning tree problems under Hamming distanceYONG HE; BINWU ZHANG; ENYU YAO et al.Journal of combinatorial optimization. 2005, Vol 9, Num 1, pp 91-100, issn 1382-6905, 10 p.Article

Segmentation graph hierarchiesHAXHIMUSA, Yil; KROPATSCH, Walter.Lecture notes in computer science. 2004, pp 343-351, issn 0302-9743, isbn 3-540-22570-6, 9 p.Conference Paper

Semi-supervised manifold learning based on 2-fold weightsFU, M; LUO, B; KONG, M et al.IET computer vision (Print). 2012, Vol 6, Num 4, pp 348-354, issn 1751-9632, 7 p.Article

A graph-theoretical clustering method based on two rounds of minimum spanning treesCAIMING ZHONG; DUOQIAN MIAO; RUIZHI WANG et al.Pattern recognition. 2010, Vol 43, Num 3, pp 752-766, issn 0031-3203, 15 p.Article

A 2 + ε approximation algorithm for the k-MST problemARORA, Sanjeev; KARAKOSTAS, George.Mathematical programming. 2006, Vol 107, Num 3, pp 491-504, issn 0025-5610, 14 p.Article

Savings based ant colony optimization for the capacitated minimum spanning tree problemREIMANN, Marc; LAUMANNS, Marco.Computers & operations research. 2006, Vol 33, Num 6, pp 1794-1822, issn 0305-0548, 29 p.Article

Approximation schemes for degree-restricted MST and red-blue separation problemsARORA, Sanjeev; CHANG, Kevin.Algorithmica. 2004, Vol 40, Num 3, pp 189-210, issn 0178-4617, 22 p.Article

Automated Centreline Extraction of Neuronal Dendrite from Optical Microscopy Image StacksLIANG XIAO; FANBIAO ZHANG.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7850, issn 0277-786X, isbn 978-0-8194-8380-5, 78502Q.1-78502Q.7Conference Paper